Virtual path layouts optimizing total hop count on ATM tree networks
نویسندگان
چکیده
منابع مشابه
Virtual path layouts optimizing total hop count on ATM tree networks
This paper presents some algorithmic results concerning virtual path layouts for the one-to-many communication problem in ATM tree networks. The ATM network model is based on covering the network with a layout of virtual paths, under some constraints on the allowed load, namely, the number of paths that can share an edge. The quality measure used is the hop count, namely, the number of edges tr...
متن کاملDirected Virtual Path Layouts in ATM Networks
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). Fo...
متن کاملVirtual Path Layouts in ATM Networks
We study virtual path layouts in a very popular type of fast interconnection networks, namely ATM networks. One of the main problems in such networks is to construct path layout that minimizes the hop-number (i.e. the number of virtual paths between any two nodes) as a function of edge congestion (i.e. the number of virtual paths going through a link). In this paper we construct for any n verte...
متن کاملDimensioning ATM Networks using 2-Layer Hierarchical Virtual Path Layouts
This paper addresses the problem of dimensioning multi-service ATM networks, where each service is supported by a different logical network. In the traditional approach, logical networks are configured with end-to-end VPCs, which greatly simplifies VCC admission control. This approach does not explore resource sharing gains since an end-to-end VPC bandwidth is assigned to each VCC flow. In this...
متن کاملDuality in Chain ATM Virtual Path Layouts
We present certain dualities occuring in the study of routing problems within ATM networks We concentrate on the one to many problem on a chain network in which one constructs a set of paths that enable connecting one vertex with all others in the network We consider the parameters of load the maximum number of paths that go through any single edge and hop count the maximum number of paths trav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2005
ISSN: 1570-8667
DOI: 10.1016/j.jda.2004.05.003